Automatic Pose similarity Computation of Motion Capture Data Through Topological Analysis
نویسندگان
چکیده
منابع مشابه
Motion Similarity Analysis and Evaluation of Motion Capture Data
Motion similarity analysis is a critical stage for the successful reuse of motion capture data. Some previous works use one or multiple motion features, such as the difference between joint positions, joint angles, joint velocities and accelerations to capture the similarity information between two frames of different or the same motion streams. In this paper, two typical motion similarity appr...
متن کاملSelf-similarity Analysis for Motion Capture Cleaning
Motion capture sequences may contain erroneous data, especially when the motion is complex or performers are interacting closely and occlusions are frequent. Common practice is to have specialists visually detect the abnormalities and fix them manually. In this paper, we present a method to automatically analyze and fix motion capture sequences by using self-similarity analysis. The premise of ...
متن کاملAutomatic Estimation of Skeletal Motion from Optical Motion Capture Data
Utilization of motion capture techniques is becoming more popular in the pipeline of articulated character animation. Based upon captured motion data, defining accurate joints position and joints orientation for the movement of a hierarchical human-like character without using a pre-defined skeleton is still a potential concern for motion capture studio. In this paper, we present a method for a...
متن کاملArticulated Motion Analysis from Motion Capture Data
We present computational methods to extract and model different joints of a generic subject, in an automatic way. The input for our methods is simply a set of trajectories of 3D points, obtained from a motion capture system (MOCAP). Due to the piecewise rigidity of the skeleton, these trajectories belong to different subspaces (of the space of all possible trajectories). We use this knowledge t...
متن کاملTOPOLOGICAL SIMILARITY OF L-RELATIONS
$L$-fuzzy rough sets are extensions of the classical rough sets by relaxing theequivalence relations to $L$-relations. The topological structures induced by$L$-fuzzy rough sets have opened up the way for applications of topological factsand methods in granular computing. In this paper, we firstly prove thateach arbitrary $L$-relation can generate an Alexandrov $L$-topology.Based on this fact, w...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Korea Institute of Information and Communication Engineering
سال: 2015
ISSN: 2234-4772
DOI: 10.6109/jkiice.2015.19.5.1199